Replica Field Theory for Deterministic Models: Binary Sequences with Low Autocorrelation
نویسندگان
چکیده
We study systems without quenched disorder with a complex landscape, and we use replica symmetry theory to describe them. We discuss the Golay-BernasconiDerrida approximation of the low autocorrelation model, and we reconstruct it by using replica calculations. Then we consider the full model, its low T properties (with the help of number theory) and a Hartree-Fock resummation of the high-temperature series. We show that replica theory allows to solve the model in the high T phase. Our solution is based on one-link integral techniques, and is based on substituting a Fourier transform with a generic unitary transformation. We discuss this approach as a powerful tool to describe systems with a complex landscape in the absence of quenched disorder. hep-th/9405148 ROM2F/94/015 Roma-La Sapienza 1019
منابع مشابه
New method for estimation of the scale of fluctuation of geotechnical properties in natural deposits
One of the main distinctions between geomaterials and other engineering materials is the spatial variation of their properties in different directions. This characteristic of geomaterials -so called heterogeneity- is studied herewith. Several spatial distributions are introduced to describe probabilistic variation of geotechnical properties of soils. Among all, the absolute normal distribution ...
متن کاملThe Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where p is an odd prime with p ≡ 1( mod 4). The...
متن کاملA class of pseudonoise sequences over GF(P) with low correlation zone
b = 1. The index set I must be of the form I = A [ B [ C where A = f1g B = fz + 1 j z 2 C0; z + 1 2 C0g and C = f0z j z 2 C1; z + 1 2 C1g: Observe that these three sets are pairwise-disjoint. Therefore, The other cases can be treated similarly. ACKNOWLEDGMENT The authors wish to thank the anonymous referee for careful review of the original manuscript and helpful comments. Double-check of the c...
متن کاملSeveral classes of binary sequences with three-level autocorrelation
In this correspondence we describe several classes of binary sequences with three-level autocorrelation. Those classes of binary sequences are based on cyclic almost difference sets. Some classes of binary sequences have optimum autocorrelation.
متن کاملA General Construction of Binary Sequences with Optimal Autocorrelation
A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes of binary sequences with optimal autocorrelation and other low autocorrelation are presented.
متن کامل